- asymptotic expansion formula
- формула асимптотического разложения (функции)
English-Russian scientific dictionary. 2008.
asymptotic expansion formula
Смотреть что такое "asymptotic expansion formula" в других словарях:
Asymptotic expansion — In mathematics an asymptotic expansion, asymptotic series or Poincaré expansion (after Henri Poincaré) is a formal series of functions which has the property that truncating the series after a finite number of terms provides an approximation to a … Wikipedia
Asymptotic theory — is the branch of mathematics which studies properties of asymptotic expansions.The most known result of this field is the prime number theorem:Let pi;( x ) be the number of prime numbers that are smaller than or equal to x .The limit:lim {x… … Wikipedia
Asymptotic analysis — This article is about the comparison of functions as inputs approach infinite. For asymptotes in geometry, see asymptotic curve. In mathematical analysis, asymptotic analysis is a method of describing limiting behavior. The methodology has… … Wikipedia
Euler–Maclaurin formula — In mathematics, the Euler–Maclaurin formula provides a powerful connection between integrals (see calculus) and sums. It can be used to approximate integrals by finite sums, or conversely to evaluate finite sums and infinite series using… … Wikipedia
Leibniz formula for pi — See Leibniz formula for other formulas known under the same name. In mathematics, the Leibniz formula for pi;, named after Gottfried Leibniz, states that:1 , , frac{1}{3} ,+, frac{1}{5} , , frac{1}{7} ,+, frac{1}{9} , , cdots ;=; frac{pi}{4}.!The … Wikipedia
Bernoulli number — In mathematics, the Bernoulli numbers Bn are a sequence of rational numbers with deep connections to number theory. They are closely related to the values of the Riemann zeta function at negative integers. There are several conventions for… … Wikipedia
Stirling's approximation — In mathematics, Stirling s approximation (or Stirling s formula) is an approximation for large factorials. It is named in honour of James Stirling.The formula is written as:n! approx sqrt{2pi n}, left(frac{n}{e} ight)^{n}.Roughly, this means that … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… … Wikipedia
Big O notation — In mathematics, big O notation is used to describe the limiting behavior of a function when the argument tends towards a particular value or infinity, usually in terms of simpler functions. It is a member of a larger family of notations that is… … Wikipedia
Hermite polynomials — In mathematics, the Hermite polynomials are a classical orthogonal polynomial sequence that arise in probability, such as the Edgeworth series; in combinatorics, as an example of an Appell sequence, obeying the umbral calculus; in numerical… … Wikipedia
